Admission Policies in Loss Queueing Models with Heterogeneous Arrivals

Admission Control Policies of Queueing Systems

Dynamic Admission Control for Loss Systems with Batch Arrivals

We consider the problem of dynamic admission control in a Markovian loss system with two classes. Jobs arrive at the system in batches, where each admitted job requires different service rates and brings different revenues depending on its class. We introduce the definition of “preferred class” for systems receiving mixed and one-class batches separately, and derive sufficient conditions for ea...

A Queueing Loss Model with Heterogeneous Skill Based Servers Under Idle Time Ordering Policies

We consider a queueing loss system with heterogeneous skill based servers with arbitrary service distributions. We assume Poisson arrivals, with each arrival having a vector indicating which of the servers are eligible to serve it. An arrival can only be assigned to a server that is both idle and eligible. Assuming exchangeable eligibility vectors and an idle time ordering assignment policy, th...

Admission control with batch arrivals

We consider the problem of dynamic admission control in a multi-class Markovian loss system receiving random batches, where each admitted class-i job demands an exponential service with rate μ, and brings a reward ri. We show that the optimal admission policy is a sequential threshold policy with monotone thresholds.

FIFO Queueing Policies for Packets with Heterogeneous Processing

We consider the problem of managing a bounded size First-In-First-Out (FIFO) queue buffer, where each incoming unit-sized packet requires several rounds of processing before it can be transmitted out. Our objective is to maximize the total number of successfully transmitted packets. We consider both push-out (when the policy is permitted to drop already admitted packets) and non-push-out cases....